Injective matrix functions
نویسندگان
چکیده
منابع مشابه
Completion after Program Inversion of Injective Functions
Given a constructor term rewriting system that defines injective functions, the inversion compiler proposed by Nishida, Sakai and Sakabe generates a conditional term rewriting system that defines the inverse relations of the injective functions, and then the compiler unravels the conditional system into an unconditional term rewriting system. In general, the resulting unconditional system is no...
متن کاملLommel Matrix Functions
The main objective of this work is to develop a pair of Lommel matrix functions suggested by the hypergeometric matrix functions and some of their properties are studied. Some properties of the hypergeometric and Bessel matrix functions are obtained.
متن کاملBuilding Injective Trapdoor Functions From Oblivious Transfer
Injective one-way trapdoor functions are one of the most fundamental cryptographic primitives. In this work we give a novel construction of injective trapdoor functions based on oblivious transfer for long strings. Our main result is to show that any 2-message statistically sender-private semihonest oblivious transfer (OT) for strings longer than the sender randomness implies the existence of i...
متن کاملGeneralized matrix functions, determinant and permanent
In this paper, using permutation matrices or symmetric matrices, necessary and sufficient conditions are given for a generalized matrix function to be the determinant or the permanent. We prove that a generalized matrix function is the determinant or the permanent if and only if it preserves the product of symmetric permutation matrices. Also we show that a generalized matrix function is the de...
متن کاملThe MacNeille Completion of the Poset of Partial Injective Functions
Abstract. Renner has defined an order on the set of partial injective functions from [n] = {1, . . . , n} to [n]. This order extends the Bruhat order on the symmetric group. The poset Pn obtained is isomorphic to a set of square matrices of size n with its natural order. We give the smallest lattice that contains Pn. This lattice is in bijection with the set of alternating matrices. These matri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1981
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1981-0624924-3